#include"BinarySearchTree.h"

void test()
{
	BSTree<int> bs;
	int arr[] = { 4,7,8,2,6,5,1,9,10 };
	for (int i = 0; i < 9; i++)
	{
		bs.RInsert(arr[i]);
	}
	bs.Inorder();
	cout << '\n';
	for (auto& e : arr)
	{
		bs.RErase(e);
		bs.Inorder();
		cout << '\n';
	}
}

int main()
{
	test();
	return 0;
}